Simulation optimization for the stochastic economic lot scheduling problem
نویسندگان
چکیده
منابع مشابه
Simulation Optimization for the Stochastic Economic Lot Scheduling Problem
We study simulation optimization methods for the stochastic economic lot scheduling problem. In contrast to prior research, we focus on methods that treat this problem as a black box. Based on a large-scale numerical study, we compare approximate dynamic programming with a global search for parameters of simple control policies. We propose two value function approximation schemes based on linea...
متن کاملThe stochastic economic lot scheduling problem: A survey
We consider the production of multiple standardized products on a single machine with limited capacity and set-up times under random demands and random production times, i.e., the so-called stochastic economic lot scheduling problem (SELSP). The main task for the production manager in this setting is the construction of a production plan for the machine that minimizes the total costs, i.e., the...
متن کاملA profit-maximizing economic lot scheduling problem with price optimization
The economic lot scheduling problem (ELSP) is a well known problem that focuses on scheduling the production of multiple items on a single machine such that inventory and setup costs are minimized. In this paper, we extend the ELSP to include price optimization with the objective to maximize profits. A solution approach based on column generation is provided and shown to produce very close to o...
متن کامل1 The Economic Lot Scheduling Problem
Economies of scale often dictate the choice of a single high speed machine capable of producing a given set of items over the choice of one dedicated machine for each item in the set. A scheduling problem arises when the high speed machine can only produce one item at a time. The problem is further complicated when the machine needs to be setup (often at a cost of both time and money) before a ...
متن کاملA Price-Directed Heuristic for the Economic Lot Scheduling Problem
We formulate the well-known economic lot scheduling problem (ELSP) with sequence dependent setup times and costs as a semi-Markov decision process. Using an affine approximation of the bias function, we obtain a semi-infinite linear program determining a lower bound for the minimum average total cost rate. The solution of this problem is directly used in a price-directed dynamic heuristic to de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IIE Transactions
سال: 2013
ISSN: 0740-817X,1545-8830
DOI: 10.1080/0740817x.2012.662310